package com.singzi.leetcode.N600;

public class T0509 {

    public static void main(String[] args) {
        Solution0509 solution0509 = new Solution0509();
        for (int i = 0; i < 20; i++) {
            System.out.println(solution0509.fib(i));
        }

    }

}
class Solution0509{

    public int fib(int n){

        if(n<=1) return n;
        int []dp = new int[n+1];
        dp[0] = 0;
        dp[1] = 1;
        for (int i = 2; i <= n; i++) {
            dp[i] = dp[i-1] + dp[i-2];

        }


        return dp[n];
    }


}
